S.A.G.B.I. bases for rings of formal modular seminvariants
نویسنده
چکیده
We use the theory of S.A.G.B.I. bases to construct a generating set for the ring of invariants for the four and five dimensional indecomposable modular representations of a cyclic group of prime order. We observe that for the four dimensional representation the ring of invariants is generated in degrees less than or equal to 2p − 3, and for the five dimensional representation the ring of invariants is generated in degrees less than or equal to 2p− 2. Mathematics Subject Classification (1991). 13A50.
منابع مشابه
Invariants in the Theory of Numbers
1. Polynomials in the coefficients of a form/(ari, • • •, ar„) which have the invariantive property with respect to all linear homogeneous transformations on ari, • • •, ar„ with integral coefficients taken modulo p, where p is a prime, are called formal invariants modulo p of /if the coefficients of/are independent variables, but are called modular invariants if the coefficients of / are integ...
متن کاملOn duality of modular G-Riesz bases and G-Riesz bases in Hilbert C*-modules
In this paper, we investigate duality of modular g-Riesz bases and g-Riesz bases in Hilbert C*-modules. First we give some characterization of g-Riesz bases in Hilbert C*-modules, by using properties of operator theory. Next, we characterize the duals of a given g-Riesz basis in Hilbert C*-module. In addition, we obtain sufficient and necessary condition for a dual of a g-Riesz basis to be agai...
متن کاملReduction Mod P of Standard Bases
We investigate the behavior of standard bases (in the sense of Hironaka and Grauert) for ideals in rings of formal power series over commutative rings with respect to specializations of the coefficients. For instance, we show that any ideal I of the ring of formal power series A[[X]] = A[[X1, . . . , XN ]] with coefficients in a Noetherian ring A admits a standard basis whose image under every ...
متن کاملEfficient RNS Bases for Cryptography
Residue Number Systems (RNS) are useful for distributing large dynamic range computations over small modular rings, which allows the speed up of computations. This feature is well known, and already used in both DSP and cryptography. In this paper we deal with implementation for huge numbers like those used for ciphering as with RSA or ECC on prime finite fields. Modular multiplication is the m...
متن کاملModular Design and Verification of Logical Knowledge Bases
In this paper we describe a framework for the design of modular knowledge based systems which is motivated by work in algebraic specification and software engineering. The main characteristic of the framework is that verification work can be done in a local setting. We present two concrete module concepts within this framework, and give formal semantics and correctness notions for them. Finally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998